package com.lch.Tree;

/**
 * 构造二叉树以及各种遍历，前中后序遍历  层序遍历
 * @author 刘晨辉
 * @date 2021/10/3 11:50 上午
 */
public class Tree {

    public static void main(String[] args) {

    }

    class Node{
        private Node pre;
        private Node left;
        private Node right;

        private String value;

        public Node() {
        }

        public Node getPre() {
            return pre;
        }

        public void setPre(Node pre) {
            this.pre = pre;
        }

        public Node getLeft() {
            return left;
        }

        public void setLeft(Node left) {
            this.left = left;
        }

        public Node getRight() {
            return right;
        }

        public void setRight(Node right) {
            this.right = right;
        }

        public String getValue() {
            return value;
        }

        public void setValue(String value) {
            this.value = value;
        }
    }


    private void preIterator(Node node){

    }
}

